1

What makes propositional abduction tractable

Gustav Nordh, Bruno Zanuttini
Journal:
Artificial Intelligence
Year:
2008
Language:
english
File:
PDF, 718 KB
english, 2008
3

The complexity of equivalence and isomorphism of systems of equations over finite groups

Gustav Nordh
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 192 KB
english, 2005
4

Perfect Skolem sets

Gustav Nordh
Journal:
Discrete Mathematics
Year:
2008
Language:
english
File:
PDF, 183 KB
english, 2008
5

-completeness of generalized multi-Skolem sequences

Gustav Nordh
Journal:
Discrete Applied Mathematics
Year:
2007
Language:
english
File:
PDF, 149 KB
english, 2007
6

A note on the hardness of Skolem-type sequences

Gustav Nordh
Journal:
Discrete Applied Mathematics
Year:
2010
Language:
english
File:
PDF, 215 KB
english, 2010
8

MAX ONES Generalized to Larger Domains

Jonsson, Peter, Kuivinen, Fredrik, Nordh, Gustav
Journal:
SIAM Journal on Computing
Year:
2008
Language:
english
File:
PDF, 370 KB
english, 2008
9

Trichotomies in the Complexity of Minimal Inference

Arnaud Durand, Miki Hermann, Gustav Nordh
Journal:
Theory of Computing Systems
Year:
2012
Language:
english
File:
PDF, 1.26 MB
english, 2012
11

Retractions to Pseudoforests

Feder, Tomás, Hell, Pavol, Jonsson, Peter, Krokhin, Andrei, Nordh, Gustav
Journal:
SIAM Journal on Discrete Mathematics
Year:
2010
Language:
english
File:
PDF, 206 KB
english, 2010
12

Approximability of Clausal Constraints

Peter Jonsson, Gustav Nordh
Journal:
Theory of Computing Systems
Year:
2010
Language:
english
File:
PDF, 605 KB
english, 2010